Simplifying Programs Extracted from Classical Proofs
نویسنده
چکیده
Curry-Howard isomorphism extended to classical logic by associating the rule of double-negation elimination with the control operator C allows to view a natural deduction derivation of a Π2 formula as a program. However, programs produced by this method are often hard to understand, in part because of the presence of control operators. In this paper, we show how to simplify such programs and make them more readable. Simplification consists of two parts: normalizing with respect to a certain set of reductions, and removing subterms of singleton type, whose origin is subderivations of atomic formulas. The latter part can in fact be applied to arbitrary functional program with side effects.
منابع مشابه
Getting results from programs extracted from classical proofs
We present a new method to extract from a classical proof of ∀x(I[x] → ∃y(O[y]∧S[x, y])) a program computing y from x. This method applies when O is a data type and S is a decidable predicate. Algorithms extracted this way are often far better than a stupid enumeration of all the possible outputs and this is verified on a non trivial example: a proof of Dickson’s lemma.
متن کاملUniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HA) that allows for the extraction of optimized programs from constructive and classical proofs. The system HA has two sorts of first-order quantifiers: ordinary quantifiers governed by the usual rules, and uniform quantifiers subject to stronger variable conditions expressing roughly that the quant...
متن کاملLight Functional Interpretation - an optimization of Gödel’s technique towards the extraction of (more) efficient programs from (classical) proofs
We give a Natural Deduction formulation of an adaptation of Gödel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proofs. We adapt Jørgensen’s formulation of pure Dialectica translation by eliminating his “Contraction Lemma” and allowing free variables in the extracted terms (which is more suitable in a Natural Deduction setting). We also...
متن کاملLight Functional Interpretation - an optimization of Gödel ’ s technique towards the extraction of ( more ) efficient programs from ( classical ) proofs - Technical Appendix
We give a Natural Deduction formulation of an adaptation of Gödel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proofs. We adapt Jørgensen’s formulation of pure Dialectica translation by eliminating his “Contraction Lemma” and allowing free variables in the extracted terms (which is more suitable in a Natural Deduction setting). We also...
متن کاملOn the pointfree counterpart of the local definition of classical continuous maps
The familiar classical result that a continuous map from a space $X$ to a space $Y$ can be defined by giving continuous maps $varphi_U: U to Y$ on each member $U$ of an open cover ${mathfrak C}$ of $X$ such that $varphi_Umid U cap V = varphi_V mid U cap V$ for all $U,V in {mathfrak C}$ was recently shown to have an exact analogue in pointfree topology, and the same was done for the familiar cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006